Is Huuman Coding Dead?
نویسنده
چکیده
In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huuman codes. While it is true that Huuman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance is often negligible. Referring also to other criteria, we conclude that for many applications, Huuman codes should still remain a competitive choice.
منابع مشابه
Constructing Huffman Trees in Parallel
We present a parallel algorithm for the Huuman Coding problem. We reduce the Huuman Coding problem to the Concave Least Weight Subsequence problem and give a parallel algorithm that solves the latter problem in O(p n log n) time with n processors on a CREW PRAM. This leads to the rst sublinear time o(n 2)-total work parallel algorithm for Huuman Coding. This reduction of the Huuman Coding probl...
متن کاملBidirectional Hu man Coding
Under what conditions can Huuman codes be eeciently decoded in both directions? The usual decoding procedure works also for backward decoding only if the code has the aax property, i.e., both preex and suux properties. Some aax Huuman codes are exhibited, and necessary conditions for the existence of such codes are given. An algorithm is presented which, for a given set of codeword lengths, con...
متن کاملParallel Huffman Decoding
A simple parallel algorithm for decoding a Huuman encoded le is presented , exploiting the tendency of Huuman codes to resynchronize quickly in most cases. An extention to JPEG decoding is mentioned.
متن کاملOn the Maximum Length of Huffman Codes
In this paper the maximum length of binary Huuman codes is investigated dependent on the two lowest probabilities of encoded symbols. Furthermore, the structure of full binary trees with a given number of leaves, a limited depth, and maximum external path length is examined to get an improved upper bound on the external path length of Huuman trees.
متن کاملA Two-Stage Scheme for Lossless Compression of Images
A two-stage lossless image compression scheme is presented , the rst stage of which decorrelates the raw image data by using a two-dimensional, causal linear predic-tor, resulting in signiicant entropy reduction. The second stage uses standard coding techniques. Diierent two-stage schemes are compared with respect to their performances on several images, using bilevel coding, arithmetic coding,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993